-
1 independence graph
Математика: граф независимости -
2 independence graph
мат. -
3 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
4 граф независимости
мат. independence graphБольшой англо-русский и русско-английский словарь > граф независимости
-
5 number
nounчисло nbinding number число сращивания/связностиgenerator of random numbers датчик m случайных чиселnumber theory теория f чиселprobabilistic number theory вероятностная теория f чиселАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > number
-
6 degree
1) градус2) матем. степень; порядок3) сорт, качество4) диплом5) степень, уровень; ступень•degrees to port — мор. градусы левого борта
degrees to starboard — мор. градусы правого борта
to some degree — до некоторой степени; в известной мере
-
7 path
1. n тропинка, тропа; дорожка2. n велосипедная дорожка3. n путь, дорога4. n курс, маршрут5. n траектория6. n физ. пробег7. n путь, стезя8. n линия поведения или действия9. n редк. ход мысли, рассуждения10. n дорожка11. n круг ипподрома12. n спорт. проход в защите13. n мед. нервный путь, проводящий путь14. v уст. следовать по путиСинонимический ряд:trail (noun) artery; avenue; boulevard; course; drive; footpath; freeway; highway; lane; line; locus; orbit; passage; pathway; road; roadway; route; scent; spoor; street; thoroughfare; track; trail; trajectory; way
См. также в других словарях:
independence number — noun the number of vertices in a maximum independent set of a given graph, often denoted as … Wiktionary
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Odd graph — The Petersen graph as an odd graph O3 Vertices Edges … Wikipedia
Dense graph — In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges. The opposite, a graph with only a few edges, is a sparse graph. The distinction between sparse and dense graphs is rather vague, and… … Wikipedia
Moral graph — A moral graph is a concept in graph theory, used to find the equivalent undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models. The moralized counterpart of a… … Wikipedia
Bivariegated graph — In graph theory, a mathematical discipline, a bivariegated graph is a graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing… … Wikipedia
Mozambican War of Independence — Part of the Portuguese Colonial Wars … Wikipedia